Limits of ML de nability
نویسنده
چکیده
It is well known that the type system of ML is overly re strictive in its handling of recursion certain intuitively sound terms do not pass ML s type check We formalise this intuition and show that the restriction is semantical there are computable semantical functions which cannot be expressed by well typed syntactical terms
منابع مشابه
Algebraic Characterizations of Two Beth Deenability Properties
In the present paper we will show that the Beth de nability property corresponds to surjectiveness of epimorphisms in abstract algebraic logic. Furthermore, we will give an equally general characterization of the weak Beth de nability property, hereby giving a solution to Problem 14 in [Sa 88]. Finally, we will present two counterexamples showing that two of the more striking assumptions impose...
متن کاملNegative De nability in Modal Logic
The aim of this paper is to give characterizations of the notion of negative de nability as introduced in Venema This notion can be seen as an alternative way of de ning classes of Kripke frames via a modal language one that enables us for instance to de ne the previously unde nable class of irre exive frames Besides a list of closure conditions for negatively de nable classes the paper contain...
متن کامل